Note on the index conjecture in zero-sum theory and its connection to a Dedekind-type sum

Note on a Zero-Sum Problem

Let G be an additively written, finite abelian group, and exp(G ) its exponent. Let S=(a1 , ..., ak) be a sequence of elements in G; we say that S is a zero-sum sequence if i=1 ai=0. Let s(G ) be the samllest integer t such that every sequence of t elements in G contains a zero-sum subsequence of length exp(G ). This constant has been studied by serveral authors during last 20 years [1 9, 11]. ...

On a Sum Analogous to Dedekind Sum and Its Mean Square Value Formula

On Bialostocki’s Conjecture for Zero-sum Sequences

A finite sequence S of terms from an (additive) abelian group is said to have zero-sum if the sum of the terms of S is zero. In 1961 P. Erdős, A. Ginzburg and A. Ziv [3] proved that any sequence of 2n− 1 terms from an abelian group of order n contains an n-term zero-sum subsequence. This celebrated EGZ theorem is is an important result in combinatorial number theory and it has many different ge...

Zero - Sum Problems and Snevily ’ S Conjecture

This is a survey of recent advances on zero-sum problems and Snevily’s conjecture concerning finite abelian groups. In particular, we will introduce Reiher’s recent solution to the Kemnitz conjecture and our simplification. 1. On Zero-sum Problems The theory of zero-sums began with the following celebrated theorem. The Erdős-Ginzburg-Ziv Theorem [Bull. Research Council. Israel, 1961]. For any c...

A Note on Zero-Sum 5-Flows in Regular Graphs

Let G be a graph. A zero-sum flow of G is an assignment of non-zero real numbers to the edges such that the sum of the values of all edges incident with each vertex is zero. Let k be a natural number. A zero-sum k-flow is a flow with values from the set {±1, . . . ,±(k − 1)}. It has been conjectured that every r-regular graph, r ≥ 3, admits a zero-sum 5-flow. In this paper we give an affirmativ...